Performance Assessment of MC Placement for Multicast Routing in WDM Networks with Spare Light Splitting

This investigation examines all-optical multicast routing in wavelength-routed optical networks with sparse Multicast Capable (MC) nodes that have three phases. The first phase is the MC node placement, and the maximum path count first (MPCF) algorithm is utilized to obtain candidates for MC nodes. The second phase is a multicast routing with MC-based schemes which including two algorithms, namely, the Pre-computing Minimum Cost Tree (PMC) and Pre-computing Shortest Path Tree (PSP) algorithms. Both algorithms use Steiner tree and shortest path tree to create an MC-based tree. The third phase is the system maintenance. System performance of PMC and PSP is compared with that of the Route to Source (RTS) algorithm in terms of average number of wavelengths needed、average call blocking probability and mean maximum transmission delay. Simulation results indicate that the proposed schemes utilize the minimum number of wavelengths needed and reduce blocking probability.